Points in Two Polytopes
نویسندگان
چکیده
We propose a separating-hyperplane algorithm for finding a nearest pair of points in two polytopes, where each polytope is expressed as the convex hull of given points in a Euclidian space. The proposed algorithm is an extension of the authors dual algorithm for finding t.he minimum-norm point in a polytope.
منابع مشابه
Lattice 3-Polytopes with Few Lattice Points
This paper is intended as a first step in a program for a full algorithmic enumeration of lattice 3-polytopes. The program is based in the following two facts, that we prove: • For each n there is only a finite number of (equivalence classes of) 3polytopes of lattice width larger than one, where n is the number of lattice points. Polytopes of width one are infinitely many, but easy to classify....
متن کاملComputation of certain measures of proximity between convex polytopes: a complexity viewpoint
Four problems of proximity between two convex polytopes in R' are considered. The convex polytopes are represented as convex hulls of finite sets of points. Let the total number of points in the two finite sets be n. W e show that three of the proximity problems, viz., checking intersection, checking whether the polytopes are just touching and finding the distance between them, can be solved in...
متن کاملAbstract Steiner Points for Convex Polytopes
STEINER POINTS FOR CONVEX POLYTOPES CHRISTIAN BERG Let & denote the set of all convex polytopes, degenerate or not, in ^-dimensional Euclidean space E. An abstract Steiner point for convex polytopes in E is a mapping S:2P-+E satisfying S(P+Q) = S(P) + S(Q) for all P, Qe0*, (1) addition on the left being Minkowski addition of convex sets, and S{a(P)) = o{S(P)) (2) for all Pe&* and all similarity...
متن کامل3-Dimensional Lattice Polytopes Without Interior Lattice Points
A theorem of Howe states that every 3-dimensional lattice polytope P whose only lattice points are its vertices, is a Cayley polytope, i.e. P is the convex hull of two lattice polygons with distance one. We want to generalize this result by classifying 3-dimensional lattice polytopes without interior lattice points. The main result will be, that they are up to finite many exceptions either Cayl...
متن کاملExtreme points of two digraph polytopes: description and applications in economics and game theory
In this paper we introduce two polytopes that respect a digraph in the sense that for every vector in the polytope every component corresponds to a node and is at least equal to the component corresponding to each successor of this node. The sharing polytope is the set of all elements from the unit simplex that respect the digraph. The fuzzy polytope is the set of all elements of the unit cube ...
متن کامل